منابع مشابه
Sum choice number of generalized θ-graphs
Let G = (V,E) be a simple graph and for every vertex v ∈ V let L(v) be a set (list) of available colors. G is called L-colorable if there is a proper coloring φ of the vertices with φ(v) ∈ L(v) for all v ∈ V . A function f : V → N is called a choice function of G and G is said to be f -list colorable if G is L-colorable for every list assignment L with |L(v)| = f(v) for all v ∈ V . The size of ...
متن کاملA Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint
Given a sequence of variables X = 〈x0, x1, . . . , xn−1〉, we consider the IncreasingSum constraint, which imposes ∀i ∈ [0, n − 2] xi ≤ xi+1, and ∑ xi∈X xi = s. We propose an Θ(n) bound-consistency algorithm for IncreasingSum.
متن کاملOn Special Generalized Douglas-Weyl Metrics
In this paper, we study a special class of generalized Douglas-Weyl metrics whose Douglas curvature is constant along any Finslerian geodesic. We prove that for every Landsberg metric in this class of Finsler metrics, ? = 0 if and only if H = 0. Then we show that every Finsler metric of non-zero isotropic flag curvature in this class of metrics is a Riemannian if and only if ? = 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1973
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000015956